首页> 外文OA文献 >Parallel Structural Optimization Applied to Bone Remodeling on Distributed Memory Machines
【2h】

Parallel Structural Optimization Applied to Bone Remodeling on Distributed Memory Machines

机译:并行结构优化在分布式存储机器的骨重塑中的应用

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

This paper demonstrates parallel structural optimization methods on distributed memory MIMD machines. We have restricted ourselves to the simpler case of minimizing a multivariate non-linear function subject to bounds on the independent variables, when the objective function is expensive to evaluate as compared to the linear algebra portion of the optimization. This is the case in structural applications, when a large three-dimensional finite element mesh is used to model the structure. This paper demonstrates how parallelism can be exploited during the function and gradient computation as well as the optimization iterations. For the finite element analysis, a 'torus-wrapped' skyline solver is used. The reflective Newton method which attempts to reduce the number of iterations at the expense of more linear algebra per iteration is compared with the more conventional active set method. All code is developed for an Intel iPSC/860, but it can be ported to other distributed memory machines. The methods developed are applied to problems in bone remodeling. In the area of biomechanics, optimization models can be used to predict changes in the distribution of material properties in bone due to the presence of an artificial implant. The model we have used minimizes a linear combination of the mass and strain energy in the entire domain subject to bounds on the densities in each finite element. Early results show that the early reflective Newton method can outperform active set methods when a significant number of variables are not active at the minimum.
机译:本文演示了分布式内存MIMD机器上的并行结构优化方法。当目标函数相对于优化的线性代数部分而言代价昂贵时,我们将自己局限于使多元非线性函数受自变量约束的最简单情况。当使用大型三维有限元网格为结构建模时,在结构应用中就是这种情况。本文演示了在函数和梯度计算以及优化迭代过程中如何利用并行性。为了进行有限元分析,使用了“ torus-wrapped”天际线求解器。尝试以减少每次迭代更多线性代数为代价的减少迭代次数的反射牛顿法与更传统的主动集方法进行比较。所有代码都是针对Intel iPSC / 860开发的,但是可以移植到其他分布式内存计算机上。开发的方法适用于骨骼重塑问题。在生物力学领域,由于存在人工植入物,优化模型可用于预测骨骼中材料特性分布的变化。我们使用的模型将整个域中质量和应变能的线性组合最小化,该线性组合受每个有限元中密度的限制。早期结果表明,当大量变量处于最小活动状态时,早期的反射牛顿法可以胜过活动集方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号